ua nt - p h / 01 02 08 2 v 2 2 9 M ay 2 00 1 EFFICIENT QUANTUM COMPUTING INSENSITIVE TO PHASE ERRORS
نویسنده
چکیده
We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for exponentially many orbits even when the quantum fidelity drops to zero. Such phase-insensitive algorithms open new possibilities for computation on realistic quantum computers.
منابع مشابه
ua nt - p h / 02 08 03 5 v 1 6 A ug 2 00 2 Kicked Rotor in Wigner Phase Space
We develop the Wigner phase space representation of a kicked particle for an arbitrary but periodic kicking potential. We use this formalism to illustrate quantum resonances and anti–resonances.
متن کاملua nt - p h / 01 05 03 7 v 1 9 M ay 2 00 1 Optimal quantum measurements for spin - 1 and spin - 3 2 particles
Positive operator valued measures (POVMs) are presented that allow an unknown pure state of a spin-1 particle to be determined with optimal fidelity when 2 to 5 copies of that state are available. Optimal POVMs are also presented for a spin-3 2 particle when 2 or 3 copies of the unknown state are available. Although these POVMs are optimal they are not always minimal, indicating that there is r...
متن کاملua nt - p h / 06 05 21 9 v 1 2 5 M ay 2 00 6 Classical simulators of quantum computers and no - go theorems
It is discussed, why classical simulators of quantum computers escape from some no-go claims like Kochen-Specker, Bell, or recent Conway-Kochen " Free Will " theorems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001